package com.summer.LanQiao;

import java.math.BigInteger;
import java.util.Arrays;
import java.util.Iterator;
import java.util.LinkedHashSet;
import java.util.Scanner;

public class MoniSai2 {
    public static void A(){
        BigInteger bigInteger = new BigInteger("2023");
        BigInteger bigInteger1 = new BigInteger("1");
        String temp = "000000";
        while (true){
            if (bigInteger.toString(2).contains(temp)) break;
            else bigInteger=bigInteger.add(bigInteger1);
        }
        System.out.println(bigInteger);
    }
    public static void B(){
        int count = 92;//31+30+31
        int year = 1950;
        for (int i = year; i <2022 ; i++) {
            if ((i%4==0&&i%400!=0)||i%100==0){count+=366;}
            else count+=365;
        }
        System.out.println(count);
    }
    public static void c(){
        int num = 10;
        while (true){
            int i = Integer.parseInt(num + "", 16);
            if (i%num==0)break;
            else num++;
        }
        System.out.println(num);
    }
    public static void D(){
        char[][] chars = new char[30][60];
        Scanner sc = new Scanner(System.in);
        for (int i = 0; i < 30 ; i++) {
            chars[i] = sc.nextLine().toCharArray();
        }
        int[][] res = new int[31][61];
        for (int i = 1; i < 31 ; i++) {
            for (int j = 1; j < 61 ; j++) {
                res[i][j] = (res[i-1][j]>res[i][j-1]?res[i-1][j]:res[i][j-1])+chars[i-1][j-1]-'0';
            }
        }
        System.out.println(res[30][60]);
    }
    public static void F(){
        Scanner sc = new Scanner(System.in);
        float t = sc.nextFloat();
        float c = sc.nextFloat();
        float s = sc.nextFloat();
        float rest = s-c;
        float speed = c/t;
        float res = rest / speed;
        long ress = (long)res;
        System.out.println(ress);
    }
    public static void G(){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        LinkedHashSet<String> strings = new LinkedHashSet<>();
        String str = "";
        for (int i = 0; i < n ; i++) {
            str = sc.nextLine();
            if (strings.contains(str)) continue;
            else strings.add(str);
        }
        Iterator<String> stringIterator = strings.iterator();
        while (stringIterator.hasNext()){
            System.out.println(stringIterator.next());
        }
    }
    public static void H(){
        Scanner sc = new Scanner(System.in);
        String orign = sc.nextLine();
        StringBuilder stringBuilder = new StringBuilder(orign);
        int index = -1;
        if (stringBuilder.reverse().toString().equals(orign)) System.out.println(orign);
        else {
            for (int i = 0,j=orign.length()-1; i < j&&j>=0; i++) {
                if (orign.charAt(i)==orign.charAt(j)){
                    int k = i+1;
                    int g = j-1;
                    boolean flag = true;
                    while (k<g&&g>=0){
                        if (orign.charAt(k)!=orign.charAt(g)){
                            flag = false;
                            break;
                        }
                        k++;
                        g--;
                    }
                    if (flag){
                        index = i;
                        break;
                    }
                }
            }
            if (index==-1) System.out.println(new StringBuilder(orign).substring(0,orign.length()-1)+stringBuilder);
            else if(index==0) System.out.println(orign);
            else {
                StringBuilder stringBuilder1 = new StringBuilder(orign);
                System.out.println(orign+new StringBuilder(stringBuilder1.substring(0,index)).reverse());
            }
        }
    }
    public static void I(){

    }
    public static void main(String[] args) {
    //A();
    B();
    //c();
        // D();
        //F();
        //G();
        //H();
        //I();

//174094882455171152761423221685761892795431233411387427793198
//650286024865090061389344606618496378829135984076361542097372
//601657541200146071777733599818266038012509478351201640618984
//143988087783837107349651099683484992553337438088068198972282
//890781586124258626539246182119762952003918195325258677229419
//698255491250839396799769357665825441616335532825361862146291
//503649293440596342887581257444442930778730382520372975343211
//325351222640703400531067500454956482168314849207060705673849
//265774579830223671554026061117300483012903885770893074783710
//083450145620356667677191627276513995926532444279237315785832
//411595106453089134746365281031552217482363035280722591085079
//053410485925413958279617719034175332412908745680774313630190
//429314820559328748143552689295945058801322270313370955837837
//939182801848609300876356583948397645861551964542532682663945
//625356614462682551015176002433628234343684739800880514363921
//982340231989891351425389287014819359798014755509282450440511
//590838726938103384801541373585690893606978941566666714061214
//952341523168827712604946036245881214982452998386986623826275
//782780208928205527678781609589000725521486468983551558405472
//149903035076783644195574734088152324666290493119955560594634
//905391288186024902215444250421277955403412298227858394469856
//607272647132163832860126054679347881638761723785858733108109
//249157334220127702410373959720286708183036202841837581704881
//367895556630088230650972282944827258473951902831431040790814
//079538232104075905120989173307660289899942087873076421916033
//622143260549608274076012938515668898707915863945382394851328
//164677964192631597026176253407553188801750590935427267220117
//591817866992665840378311257621611574856498432538327068011953
//631534031790352912617015229051836886166704989498756486878095
//690013558017746707412183571476823027885971347137127534455141
    }
}
